A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Chopra, Vinay
- ACO Based SAT Solver for FPGA Routing:A Novel Approach
Authors
1 Computer Science & Engineering Department with the DAV Institute of Engineering and Technology, Jalandhar, Punjab, IN
2 Computer Science & Engineering Department with University College of Engineering, Punjabi University, Patiala, Punjab, IN
Source
Programmable Device Circuits and Systems, Vol 3, No 4 (2011), Pagination: 182-186Abstract
In this paper ANT colony optimization algorithm are used to solve geometric FPGA routing for a route based routing constraint model in FPGA design architecture. In our method geometric FPGA routing task is transformed into a Boolean satisfiability (SAT) equation with the property that any assignment of input variables that satisfies the equation specifies a valid route. The satisfiability equation is then modeled as Constraint Satisfaction problem, which helps in reducing procedural programming. Satisfying assignment for particular route will result in a valid routing and absence of a satisfying assignment implies that the layout is unroutable. In second phase ant colony optimization algorithm is applied on the Boolean equation for solving routing alternatives utilizing approach of hard combinatorial optimization problems for stationary and non-stationary environments. The ACO based solution to SAT is then compared with the other SAT solver algorithms such as zChaff and GRASP. Preliminary experimental results suggest that the developed ant colony optimization algorithm is taking mlogm iterations, where m is number of Boolean instances. The experiments has shown that that ACO has performed efficiently to solve SAT based FPGA routing than classical algorithms and has improved complexity of O(nm/ρ log n).Keywords
FPGA Routing, Route Based Model, Constraint Satisfaction Programming, Boolean Satisfiability.- Enhanced DNA Computing Biological Model for Implementing a Covert Communication Channel
Authors
1 Mehr Chand Polytechnic College, Jalandhar, State, Punjab, IN
2 DAV Institute of Engineering and Technology, Jalandhar, State Punjab, IN
Source
Networking and Communication Engineering, Vol 1, No 5 (2009), Pagination: 210-218Abstract
DNA computing, also known as molecular computing,is a new approach to massively parallel computation. It harnesses the enormous parallel computing ability and high memory density of biomolecules,which brings potential challenges and opportunities to traditional cryptography. DNA Steganography is a new field arising with DNA computing research in recent years. Most of the techniques that were implemented were based on modulating a media file to hide the information required to be transmitted. If the transmission is rather continuous in time, one may refer to the technique as a covert communication channel between two parties.Various methods of advanced steganalysis techniques, with varying degrees of success, were developed to detect the existence of such hidden messages in a media file.
In this work, we present an alternative approach to hiding data in text files. We use different DNA-operations and the message is embedded within a vector sequence. The proposed method covers all the words of English Dictionary for framing a message.
Keywords
DNA Computing, DNA Steganography, DNA Vector.- Image Quantization using HSI based on Bacteria Foraging Optimization
Authors
1 Department of Computer Science & Engg, D.A.V. I.E.T., Jalandhar, Punjab, IN
Source
Research Cell: An International Journal of Engineering Sciences, Vol 6 (2012), Pagination: 85-111Abstract
Bacteria Foraging Optimization a nature-inspired optimization has drawn the attention of researchers because of its efficiency in solving real-world optimization problems arising in several application domains. Color image quantization is an important process of representing true color images using a small number of colors. Existing color reduction techniques tend to alter image color structure and distribution. Thus the researchers are always finding alternative strategies for color quantization. In cylindrical color spaces like HSI, color is represented by hue, saturation and intensity. These components are closer to the way human perceives and describes color. Hue, saturation and intensity can also reveal image features that are not so obvious in other color spaces. The objective of this research work, is to design an algorithm for Image Quantization using HSI color space based on Bacteria Foraging Optimization. To implement and test the proposed algorithm. To compare the designed algorithm with other quantization techniques. The conducted experiments indicate that proposed algorithm generally results in a significant improvement of image quality compared to other well-known approaches.Keywords
Color Reduction, Bacteria Foraging Optimization, HSI Color Space, Euclidean Distance, Swarm Intelligence.- Fuzzy Model for Optimizing Strategic Decisions using Matlab
Authors
1 DAV Institute of Engineering. & Technology, Jalandhar, IN
Source
Research Cell: An International Journal of Engineering Sciences, Vol 1 (2011), Pagination: 270-282Abstract
Designing of Fuzzy model for optimizing the strategic decision can be very helpful to protect the failures in the system and software. The systems and software development industry is characterized by a paradigm of project failure. One of the known contributing causes of these project failures is poor requirements engineering and management, poor design strategy which has been repeatedly and widely issued and documented. The above problems could be easily countered by the Fuzzy logic, because fuzzy logic has ability to deal with uncertainty and multi valued logic This paper explains the technique for tracking the progress of the software project being built and the technique for selecting an optimal PERT chart developed by using fuzzy logic and it also explains the important variables that effects the strategic decisions connected with the software project.- Fuzzy Logic Based Framework for Software Development Effort Estimation
Authors
1 Department of Information Technology, Amritsar College of Engg. & Technology, Amritsar, Punjab, IN
2 Department of Computer Science, DAV Institute of Engg. & Technology, Jalandhar, Punjab,, IN
Source
Research Cell: An International Journal of Engineering Sciences, Vol 1 (2011), Pagination: 330-342Abstract
Software development effort estimation is among one of the most challenging jobs that software developers need to perform. Due to the lack of information during the early stages of software development, the developers often express their inability to estimate accurately the effort, cost and schedule of the software under consideration. This inaccuracy in estimation leads to monetary losses as well delay in delivery of the product. In this paper, a soft computing based technique is explored to overcome the problems of uncertainty and imprecision resulting in improved process of software development effort estimation. In doing so, fuzzy logic is applied to different parameters of Constructive Cost Model (COCOMO) II. Results shows that the value of MMRE (Mean of Magnitude of Relative Error) and pred obtained by means of applying fuzzy logic is much better than of MMRE of algorithmic model. The validation of results is carried out on COCOMO dataset.Keywords
Software Cost Estimation, COCOMO, Soft Computing, Fuzzy Logic.- A Novel Approach for Test Data Generation
Authors
1 Department of Computer Science and Engineering, IK Gujral Punjab Technical University, IN
2 Master of Computer Applications, D.A.V. Institute of Engineering and Technology, IN
Source
ICTACT Journal on Soft Computing, Vol 12, No 4 (2022), Pagination: 2669-2677Abstract
Software testing is an essential phase in software design process, accounting for more than half of the total cost due to its rigorous and time-consuming nature. Path test data generation is the most important stage in software testing, and researchers have devised several methods to automate it. In this research, a novel approach based on ant colony optimization and negative selection algorithm (NSA) is projected to automatically create test data for path testing. The most widely used benchmark programs such as triangle classification, dayfinder, minmax and isprime, has been used to test the proposed approach. When compared to random testing, the experimental findings reveal that the proposed method is more efficient in terms of coverage, execution time and more effective in terms of test data creation.Keywords
Test Data Generation (TDG), Meta-Heuristic, Artificial Immune Algorithm, ACO, NSA, Path Coverage, Fitness FunctionReferences
- S.C. Ntafos, “A Comparison of Some Structural Testing Strategies”, IEEE Transactions on Software Engineering, Vol. 14, No. 6, pp. 868-874, 1988.
- G.D. Everett and R. McLeod, “Software Testing: Testing Across the Entire Software Development Life Cycle”, Wiley, 2006.
- K. Sneha and G.M. Malle, “Assistant Professor in Computer Science Department”, Proceedings of International Conference on Energy, Communication Data Analysis, pp. 77-81, 2017.
- M.A. Jamil, M. Arif, N. Sham, A. Abubakar and A. Ahmad, “Software Testing Techniques : A Literature Review”, Proceedings of International Conference on Information and Communication Technology, pp. 1-6, 2016.
- N. Anwar and S. Kar, “Review Paper on Various Software Testing Techniques and Strategies”, Global Journal of Computer Science and Technology: C Software and Data Engineering, Vol. 19, No. 2, pp. 1-8, 2019.
- O. Sahin and B. Akay, “Comparisons of Metaheuristic Algorithms and Fitness Functions on Software Test Data Generation”, Applied Soft Computing, Vol. 49, pp. 1202-1214, 2016.
- V. Garousi and M.V. Mantyla, “A Systematic Literature Review of Literature Reviews in Software Testing”, Information and Software Technology, Vol. 80, pp. 1339-1351, 2016.
- S. Parnami, “Testing Target Path by Automatic Generation of Test Data using Genetic Algorithm”, International Journal of Information and Computation Technology, Vol. 3, No. 8, pp. 825-832, 2013.
- K. Lakhotia and P. Mcminn, “Automated Test Data Generation for Coverage : Haven’t We Solved This Problem Yet ?”, Proceedings of International Conference on Practice and Research Techniques, pp. 1-6, 2009.
- M. Dorigo, M. Birattari and T. Stützle, “Ant Colony Optimization Artificial Ants as a Computational Intelligence Technique”, IEEE Computational Intelligence Magazine, Vol. 1, No. 4, pp. 28-39, 2006.
- S. Anand, “An Orchestrated Survey of Methodologies for Automated Software Test Case Generation Orchestrators and Editors”, The Journal of Systems and Software, Vol. 86, No. 2013, pp. 1978-2001, 2015.
- M. Harman, S.A. Mansouri and Y. Zhang, “A Comprehensive Analysis and Review of Trends Techniques and Applications”, Search Based Software Engineering, Vol. 12, pp. 1-18, 2009.
- M. Harman and P. Mcminn, “A Multi - Objective Approach To Search - Based Test Data Generation”, Proceedings of 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1098-1105, 2007.
- W. Rhmann, “Dynamic Test Data Generation using Negative Selection Algorithm and Equivalence Class Partitioning”, International Journal of Advanced Research in Computer Science, Vol. 8, No. 3, pp. 189-192, 2017.
- J. Al-Enezi, M. Abbod and S. Alsharhan, “Artificial Immune Systems-Models, Algorithms and Applications”, International Journal of Research and Reviews in Applied Sciences, Vol. 3, No. 3, pp. 118-131, 2010.
- R. Rahnamoun, “Distributed Black-Box Software Testing Using Negative Selection”, International Journal of Smart Electrical Engineering, Vol. 2, No. 3, pp. 151-157, 2013.
- I. Journal, C. Vision, S. Mustafa, R. Mohamad and U. Teknologi, “Automated Path Testing using the Negative Selection Algorithm”, International Journal of Computational Vision and Robotics, Vol. 7, No. 1-2, pp. 1-15, 2017.
- A. Pachauri, “Use of Clonal Selection Algorithm as Software Test Data Generation Technique”, Proceedings of International Conference on Advanced Computing and Communication Technologies, Vol. 2, No. 2, pp. 1-5, 2012.
- S.M.M. Id, R. Mohamad and S. Deris, “Optimal Path Test Data Generation based on Hybrid Negative Selection Algorithm and Genetic Algorithm”, PLOS One, Vol. 34, No. 3, pp. 1-21, 2020.
- S.M. Mohi-Aldeen, S. Deris and R. Mohamad, “Systematic Mapping Study in Automatic Test Case Generation”, Frontiers in Artificial Intelligence, Vol. 265, pp. 703-720, 2014.
- M. Harman and B.F. Jones, “Search-based Software Engineering”, Information and Software Technology, Vol. 43, pp. 833-839, 2001.
- G.I. Latiu, O.A. Cret and L. Vacariu, “Automatic Test Data Generation for Software Path Testing using Evolutionary Algorithms”, Proceedings of 3rd International Conference on Emerging Intelligence Data Web Technology, pp. 1-8, 2012.
- M. Harman, P. Mcminn and R. Court, “A Theoretical and Empirical Analysis of Evolutionary Testing and Hill Climbing for Structural Test Data Generation”, Proceedings of International Symposium on Software Testing and Analysis, pp. 73-83, 2007.
- Y. Chen, Y. Zhong, T. Shi and J. Liu, “Comparison of Two Fitness Functions for GA-based Path-Oriented Test Data Generation”, Proceedings of International Conference on Natural Computation, pp. 1-15, 2009.
- H. Tahbildar and B. Kalita, “Automated Software Test Data Generation: Direction of Research”, International Journal of Computer Science and Engineering Survey, Vol. 2, No. 1, pp. 1-12, 2011.
- X. Zhu, “Software Test Data Generation Automatically Based on Improved Adaptive Particle Swarm Optimizer”, Proceedings of International Conference on Computational and Information Sciences, pp. 1300-1303, 2010.
- S. Singla, D. Kumar, H.M. Rai and P. Singla, “A Hybrid PSO Approach to Automate Test Data Generation for Data Flow Coverage with Dominance Concepts”, International Journal of Advanced Science and Technology, Vol. 37, pp. 15-26, 2011.
- D.A.N. Liu, X. Wang and J. Wang, “Automatic Test Case Generation based on Genetic Algorithm”, Proceedings of International Conference on Control Systems, Computing and Engineering, Vol. 48, No. 1, pp. 411-416, 2013.
- M.A. Ahmed and I. Hermadi, “GA-based Multiple Paths Test Data Generator”, Computer and Operation Research, Vol. 35, pp. 3107-3124, 2008.
- S. Sekhara, B. Lam, M.L.H. Prasad and S. Ch, “Automated Generation of Independent Paths and Test Suite Optimization using Artificial Bee Colony”, Procedia Engineering, Vol.12, No. 1, pp. 1-5, 2021.
- S.S. Dahiya, J.K. Chhabra and S. Kumar, “Application of Artificial Bee Colony Algorithm to Software Testing”, Proceedings of International Conference on Software Engineering, pp. 149-154, 2010.
- B. Suri, P. Kaur, D.B. Suri and P. Kaur, “Path Based Test Suite Augmentation using Artificial Bee Colony Algorithm”, International Journal for Research in Applied Science and Engineering Technology, Vol. 2, No. 9, pp. 156-164, 2014.
- S. Yang, T. Man and J. Xu, “Improved Ant Algorithms for Software Testing Cases Generation”, The Scientific World Journal, Vol. 2014, pp. 1-13, 2014.
- C. Mao, L. Xiao, X. Yu and J. Chen, “Adapting Ant Colony Optimization to Generate Test Data for Software Structural Testing”, Swarm Evolutionary Computing, Vol. 20, pp. 23-36, 2015.
- P. Sharma, “Automated Software Testing using Metahurestic Technique Based on Improved Ant Algorithms for Software Testing”, Proceedings of International Symposium on Electronic System Design, pp. 3505-3510, 2010.
- P.R. Srivastava, “Automated Software Testing using Metahurestic Technique Based on An Ant Colony Optimization”, Proceedings of International Conference on Advanced Computing, pp. 1-13, 2010.
- F. Sayyari and S. Emadi, “Automated Generation of Software Testing Path based on Ant Colony”, Proceedings of International Conference on Technology, Communication and Knowledge, pp. 11-12, 2015.
- S.M. Mohi-Aldeen, R. Mohamad and S. Deris, “Application of Negative Selection Algorithm (NSA) for Test Data Generation of Path Testing”, Applied Soft Computing, Vol. 49, pp. 1118-1128, 2016.
- P. Saini and S. Tyagi, “Test Data Generation for Basis Path Testing using Genetic Algorithm and Clonal Selection Algorithm”, International Journal of Science and Research, Vol. 3, No. 6, pp. 2012-2015, 2014.
- C. Mao, X. Yu, J. Chen and J. Chen, “Generating Test Data for Structural Testing Based on Ant Colony Optimization”, Proceedings of International Conference on Quality Software, pp. 98-101, 2012.
- S.M. Mohialdeen, R. Mohamad and S. Deris, “Automatic Test Case Generation for Structural Testing using Negative Selection Algorithm”, Proceedings of International Conference on Recent Trends in Information and Communication Technologies, pp. 1-12, 2014.
- A.E. Rizzoli, “Ant Colony Optimization for Real-World Vehicle Routing Problems”, Swarm Intelligence, Vol. 133, No. 1, pp. 87-151, 2007.
- M. Dorigo, V. Maniezzo and A. Colorni, “The Ant System: Optimization by a Colony of Cooperating Agents”, IEEE Transactions on Systems, Man and Cybernetics-Part B, Vol. 26, No. 1, pp. 1-26, 1999.
- K. Socha and M. Dorigo, “Ant Colony Optimization for Continuous Domains”, European Journal of Operational Research, Vol. 185, No. 3, pp. 1155-1173, 2008.
- S. Nallaperuma, M. Wagner and F. Neumann, “Ant Colony Optimisation and the Traveling Salesperson Problem - Hardness, Features and Parameter Settings Categories and Subject Descriptors”, Proceedings of International Conference on Companion on Genetic and Evolutionary Computation, 2013.
- C.S.G Dhas and T.D. Geleto, “D-PPSOK Clustering Algorithm with Data Sampling for Clustering Big Data Analysis”, Academic Press, 2022.
- J. Timmis, A. Hone, T. Stibor and E. Clark, “Theoretical Advances in Artificial Immune Systems”, Theoretical Computer Science, Vol. 403, No. 1, pp. 11-32, 2008.
- S. Stepney, “Conceptual Frameworks for Artificial Immune System”, International Journal of Unconventional Computing, Vol. 1, No. 3, pp. 315-338, 2005.
- D. Dasgupta, “Advances in Artificial Immune Systems”, IEEE Computational Intelligence Magazine, Vol. 1, No. 4, pp. 40-43, 2006.
- M. Ponnusamy, P. Bedi and T. Suresh, “Design and Analysis of Text Document Clustering using SALP Swarm Algorithm”, The Journal of Supercomputing, Vol. 12, pp. 1-17, 2022.
- Z. Liu, T.A.O. Li, J.I.N. Yang and T.A.O. Yang, “An Improved Negative Selection Algorithm Based on Subspace Density Seeking”, IEEE Access, Vol. 5, pp. 12189-12198, 2017.
- H. Hou and G. Dozier, “An Evaluation of Negative Selection Algorithm with Constraint-Based Detectors”, Proceedings of 44th International Conference on Recent Trends in Information Technology, pp. 134-139, 2006.
- P. Agarwal, “Nature-Inspired Algorithms: State-of-Art, Problems and Prospects”, International Journal of Computer Applications, Vol. 100, No. 14, pp. 14-21, 2014.
- E. Alba and J.F. Chicano, “Software Testing with Evolutionary Strategies”, Lecture Notes in Computer Science, pp. 50-65, 2006.
- I. Hermadi, C. Lokan and R. Sarker, “Dynamic Stopping Criteria for Search-Based Test Data Generation for Path Testing”, Information and Software Technology, Vol. 56, No. 4, pp. 395-407, 2014.
- S. Kumar, D.K. Yadav and D.A. Khan, “Artificial Bee Colony based Test Data Generation for Data-Flow Testing”, Indian Journal on Science and Technology, Vol. 9, No. 39, pp. 1-13, 2016.
- C.C. Michael, G. McGraw and M.A. Schatz, “Generating Software Test Data by Evolution”, IEEE Transactions on Software Engineering, Vol. 27, No. 12, pp. 1085-1110, 2001.
- A.S. Ghiduk, “Automatic Generation of Basis Test Paths using Variable Length Genetic Algorithm”, Information Processing Letters, Vol. 114, No. 6, pp. 304-316, 2014.
- R. Malhotra, “Comparison of Search based Techniques for Automated Test Data Generation”, International Journal of Computer Applications, Vol. 95, No. 23, pp. 4-8, 2014.